The Anchor-Robust Project Scheduling Problem

In project scheduling, the durations of activities are often uncertain. Delays may cause a massive disorganization if large number must be rescheduled. “The Anchor-Robust Project Scheduling Problem,” Bendotti, Chrétienne, Fouilhoux, and Pass-Lanneau propose novel criterion for solution stability in scheduling under processing times uncertainty. They define anchored jobs as whose starting can guaranteed baseline schedule. Finding schedule with bounded makespan max-weight set anchors is shown to an NP-hard robust two-stage problem. Taking advantage combinatorial structure budgeted uncertainty, authors obtain compact MIP formulation Numerical results show that obtained outperforms standard techniques from literature. also showcase practical interest scheduling.